|
課程名稱 |
離散最佳化
DISCRETE OPTIMIZATION |
|
開課學期 |
96-2 |
|
授課對象 |
電機資訊學院 電信工程學研究所 |
|
授課教師 |
張時中 |
|
課號 |
EE5077 |
|
課程識別碼 |
921 U3410 |
|
班次 |
|
|
學分 |
3 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期二6,7,8(13:20~16:20) |
|
上課地點 |
電二225 |
|
備註 |
總人數上限：50人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
本課程尚未建立核心能力關連 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
1. Course Overview, Algorithms and Complexity and Basics of Optimization.
2. Linear Programming: Problems, Properties and Simplex Algorithms
3. Duality Theorem and Sensitivity
4. Interior Point Methods for LP
5. Network Representation and Shortest Path Algorithms
6. Distributed Shortest Path Algorithms
7. Minimum Spanning Tree Problem
8. Maximum Flow and Minimum Cost Flow Algorithms
9. Integer Programming Algorithms
10.The Traveling Salesman Problem and Knapsack Problem
11.Simulated Annealing
12.Tabu Search
13.Genetic Algorithms
14.Artificial Neural Networks for Optimization
15.Specific Applications |
|
課程目標 |
- To introduce to students the theory, models, analysis, approximations and algorithms of optimization over discrete variables
- To guide students to apply the theory to and design methods for solving electrical engineering and computer science problems. |
|
課程要求 |
Grading
Homework 30% Mid-term Exam 35% Term Project 35%
Participation 5%
|
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
|
|
參考書目 |
C. H. Papadimitriou, K. Steiglitz, Combinatorial Optimization:Algorithms and Complexity, Prentice Hall, 1982.
E. Aarts, J. K. Lenstra, eds., Local Search in Combinatorial Optimization, Wiley, 1997. |
|
評量方式
(僅供參考) |
|
No. |
項目 |
百分比 |
說明 |
|
1. |
期中考 |
20% |
|
2. |
期末考 |
20% |
|
3. |
作業 |
20% |
|
4. |
報告 |
20% |
|
5. |
出席 |
20% |
|
|
|